The Minimal Logically-Defined NP-Complete Problem
نویسندگان
چکیده
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملOn the Complexity of Linking Deductive and Abstract Argument Systems
We investigate the computational complexity of a number of questions relating to deductive argument systems, in particular the complexity of linking deductive and more abstract argument systems. We start by presenting a simple model of deductive arguments based on propositional logic, and define logical equivalence and defeat over individual arguments. We then extend logical equivalence to sets...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملExplaining User Errors in Knowledge Base Completion
Knowledge base completion is a method for extending both the terminological and assertional part of a Description Logic knowledge base by using information provided by a domain expert. It ensures that the extended knowledge base is complete w.r.t. a fixed interpretation in a certain, well-defined sense. Here we consider the problem of explaining user errors in knowledge base completion. We show...
متن کاملApproximating Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. Lattice automata generalize the traditional setting and map words to values taken from a lattice. In particular, in a fully-ordered lattice, the elements are 0, 1, . . . , n − 1, ordered by the standard ≤ order. Lattice automata, and in particular lattice automata defined with respect to fully-ordered lattices, have i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004